A Nonmeasurable Set from Coin Flips

نویسندگان

  • Alexander E. Holroyd
  • Terry Soo
چکیده

To motivate the elaborate machinery of measure theory, it is desirable to have an example of a set which is not measurable in some natural space. The usual example is the Vitali set, obtained by picking one representative from each equivalence class of R induced by the relation x ∼ y iff x − y ∈ Q. The translation-invariance of Lebesgue measure implies that the resulting set is not Lebesgue-measurable [4]. By the Solovay Theorem [3], one cannot construct such a set in ZermeloFrankel set theory without appealing to the axiom of choice. In this note we give a variant construction in the language of probability theory, using the axiom of choice in the guise of the well-ordering principle [5]. For other constructions see [2, Ch. 5]. Consider the measure space (Ω,F , P), where Ω = {0, 1}, and F is the product σ-algebra, and P is the product measure ( 1 2 δ0 + 1 2 δ1) . This is the probability space for a sequence of independent fair coin flips indexed by Z. It is well-known that (Ω,F , P) is isomorphic up to null sets to Lebesgue measure on [0, 1), via binary expansion [1, Theorem 3.19].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal linear Bernoulli factories for small mean problems

Suppose a coin with unknown probability p of heads can be flipped as often as desired. A Bernoulli factory for a function f is an algorithm that uses flips of the coin together with auxiliary randomness to flip a single coin with probability f(p) of heads. Applications include perfect sampling from the stationary distribution of certain regenerative processes. When f is analytic, the problem ca...

متن کامل

Faster Agreement via a Spectral Method for Detecting Malicious Behavior

We address the problem of Byzantine agreement, to bring processors to agreement on a bit in the presence of a strong adversary. This adversary has full information of the state of all processors, the ability to control message scheduling in an asynchronous model, and the ability to control the behavior of a constant fraction of processors which it may choose to corrupt adaptively. In 1983, Ben-...

متن کامل

Tossing a Biased Coin

When we talk about a coin toss, we think of it as unbiased: with probability one-half it comes up heads, and with probability one-half it comes up tails. An ideal unbiased coin might not correctly model a real coin, which could be biased slightly one way or another. After all, real life is rarely fair. This possibility leads us to an interesting mathematical and computational question. Is there...

متن کامل

Translation - Equivariant Matchings of Coin

Consider independent fair coin-flips at each site of the lattice Z d. A translation-equivariant matching rule is a perfect matching of heads to tails that commutes with translations of Z d and is given by a deterministic function of the coin-flips. Let Z Φ be the distance from the origin to its partner, under the translation-equivariant matching rule Φ. Holroyd and Peres [9] asked what is the o...

متن کامل

Simulating a die roll by flipping two coins

We show how to simulate a roll of a fair n-sided die by one flip of a biased coin with probability 1/n of coming up heads, followed by 3⌊log 2 n⌋+ 1 flips of a fair coin. Let a p-coin be a biased coin with probability p of coming up heads. A fair coin is a (1/2)-coin. A fair n-sided die is a die with n sides, each of which comes up with probability 1/n when the die is rolled. Proposition 1. For...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 116  شماره 

صفحات  -

تاریخ انتشار 2009